Using Closed Sets of Rules for the Entailment of Literals
نویسندگان
چکیده
Entailment that is based on the application of simple production rules, of the form c← a1, . . . , an (n ≥ 0) is weaker than the propositional entailment that would be yielded by translating these rules into material implications. In this paper, we show that rulebased entailment coincides with the propositional entailment of literals, when the set of rules is closed under transposition, transitivity and antecedent cleanup.
منابع مشابه
Proof of completeness of the SCIFF proof-procedure
This document provides the proof of completeness of the SCIFF proofprocedure. 1 Declarative semantics In the following we give semantics to a society instance by identifying sets of expectations which, together with the society’s knowledge base and the happened events, imply an instance of the goal if any and satisfy the integrity constraints. For notion of integrity constraint satisfaction we ...
متن کاملTemporally Annotated Extended Logic Programs
Extended logic programs (ELPs) are a set of logic rules with strong negation allowed in the bodies or head of the rules and weak negation ~ allowed in the bodies of the rules. ELPs enable for various forms of reasoning that cannot be achieved by definite logic programs. Answer Set Programming provides a widely acceptable semantics for ELPs. However, ELPs do not provide information regarding t...
متن کاملOn the complexity of entailment in existential conjunctive first-order logic with atomic negation
We consider the entailment problem in the fragment of first-order logic (FOL) composed of existentially closed conjunctions of literals (without functions), denoted FOL(∃,∧,¬a). This problem can be recast as several fundamental problems in artificial intelligence and databases, namely query containment for conjunctive queries with negation, clause entailment for clauses without functions and qu...
متن کاملA New Approach for Knowledge Based Systems Reduction using Rough Sets Theory (RESEARCH NOTE)
Problem of knowledge analysis for decision support system is the most difficult task of information systems. This paper presents a new approach based on notions of mathematical theory of Rough Sets to solve this problem. Using these concepts a systematic approach has been developed to reduce the size of decision database and extract reduced rules set from vague and uncertain data. The method ha...
متن کاملFunctionally closed sets and functionally convex sets in real Banach spaces
Let $X$ be a real normed space, then $C(subseteq X)$ is functionally convex (briefly, $F$-convex), if $T(C)subseteq Bbb R $ is convex for all bounded linear transformations $Tin B(X,R)$; and $K(subseteq X)$ is functionally closed (briefly, $F$-closed), if $T(K)subseteq Bbb R $ is closed for all bounded linear transformations $Tin B(X,R)$. We improve the Krein-Milman theorem ...
متن کامل